Halifax, Nova Scotia - PDFSEARCH.IO - Document Search Engine

Halifax, Nova Scotia
Results: 3693

#	Item
131	CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 Coloring Objects Built From Bricks Suzanne Gallagher∗ Abstract Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-01-08 18:44:32 Theoretical computer science Bricks Construction Mosaic Symmetry Tessellation Colorable Zonohedron Polyhedron Graph theory Mathematics Graph coloring
132	CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 Approximating the Geometric Minimum-Diameter Spanning Tree Michael J. Spriggs∗ J. Mark Keil† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-01-08 18:44:30 Spanning tree Tree Planar separator theorem Steiner tree problem Graph theory Theoretical computer science Mathematics
133	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Sphere Packing with Limited Overlap Mabel Iglesias-Ham ∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-05-08 11:38:18 Crystallography Spheres Cubes Sphere packing Packing problem Lattice Cubic crystal system Brillouin zone Voronoi diagram Geometry Mathematics Discrete geometry
134	CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 Parallel Morphing of Trees and Cycles∗ Therese Biedl† Anna Lubiw† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-01-08 18:44:31 Graph drawing Graph Planar graph Polyhedron Tree Graph theory Geometric graph theory Topological graph theory
135	CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 On the worst-case complexity of the silhouette of a polytope Helmut Alt ∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-01-08 18:44:29 Polyhedron Polygon Algebraic topology Convex polytope Abstract polytope Geometry Polytopes Real algebraic geometry
136	CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 The Strange Complexity of Constrained Delaunay Triangulation Jonathan Richard Shewchuk Computer Science Division University of California at Berkeley Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-01-08 18:44:34 Deltahedra Platonic solids Polyhedra Elementary geometry Polyhedron Circumscribed sphere Tetrahedron Delaunay triangulation Icosahedron Geometry Euclidean geometry Convex geometry
137	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 The Generalized Minimum Manhattan Network Problem (GMMN) – Scale-Diversity Aware Approximation and a Primal-Dual Algorithm Stefan Funke∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-06-21 05:15:26 Convex optimization Operations research Linear programming Mathematical optimization Approximation algorithm Computational complexity theory Optimization problem Duality Algorithm Theoretical computer science Applied mathematics Mathematics
138	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Improved bounds for Smallest Enclosing Disk Range Queries Sankalp Khare∗ Jatin Agarwal† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-06-21 05:40:24 Polytopes Computational geometry Convex hull Convex set Convex polytope Polyhedron Dual polyhedron Circle Duality Geometry Convex geometry Convex analysis
139	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Decontaminating planar regions by sweeping with barrier curves Borislav Karaivanov∗, Minko Markov†, Jack Snoeyink‡, Tzvetalin S. Vassilev§ Abstract Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-07-30 18:42:20 Metric geometry Topology Euclidean plane geometry Simple polygon Circle Sweep line algorithm Canonical bundle Area Geometry Polygons Curves
140	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Minimum Convex Container of Two Convex Polytopes under Translations∗ Hee-Kap Ahn† Sang Won Bae‡ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-06-17 10:27:30 Polytopes Convex analysis Computational geometry Convex hull Convex polytope Convex set Minkowski addition Polyhedron Polyhedral combinatorics Geometry Mathematics Convex geometry

UPDATE